Edge linking by using causal neighborhood window
نویسنده
چکیده
Xie, M., Edge linking by using causal neighborhood window, Pattern Recognition Letters 13 (1992) 647-656. A novel edge linking algorithm will be presented in this paper. We shall make use of two concepts: (a) the concept of horizontal edge element and (b) the concept of causal ne,~hborhood window for realizing the edge linking. On the basis of these two concepts, the proposed algorithm will carry out (in one pass on the edge map) the edge linking by performing two operations which are the contour chain creation and the contour cha#! extension. For the illustration of the applicability of our algorithm, some experimental results with real images will be shown. Kt:rwords. Edge linking.
منابع مشابه
Loop analysis of causal feedback in epidemiology: an illustration relating to urban neighborhoods and resident depressive experiences.
The causal feedback implied by urban neighborhood conditions that shape human health experiences, that in turn shape neighborhood conditions through a complex causal web, raises a challenge for traditional epidemiological causal analyses. This article introduces the loop analysis method, and builds off of a core loop model linking neighborhood property vacancy rate, resident depressive symptoms...
متن کاملA New Real Time Edge Linking Algorithm and Its Vlsi Implementation
Edges produced by existing edge detection algorithms often contain discontinuities. Edge linking as a post-processing step is an important step for computer vision and pattern recognition. We present a real-time algorithm and its VLSI implementation for linking broken edges. First, all broken edge points inside a 12 12 moving window are identiied. The 12 12 window scans the input gray level edg...
متن کاملEstimating neighborhood health effects: the challenges of causal inference in a complex world.
Oakes raises a series of important questions on the validity of past work on neighborhood health effects and suggests directions the field should take (Oakes, 2003). Indeed the limited nature of the evidence linking neighborhoods to individual-level outcomes, and its many methodological problems, have been noted in health and other fields (Diez Roux, 2001; Duncan & Raudenbush, 1999; Furstenberg...
متن کاملAn Approach for Accurate Edging using Dynamic Membership Functions
In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 13 شماره
صفحات -
تاریخ انتشار 1992